Optimality Conditions for Quasiconvex Programs
نویسندگان
چکیده
We present necessary and sufficient optimality conditions for a problem with a convex set constraint and a quasiconvex objective function. We apply the obtained results to a mathematical programming problem involving quasiconvex functions.
منابع مشابه
Generalized convex functions and generalized differentials
We study some classes of generalized convex functions, using a generalized di¤erential approach. By this we mean a set-valued mapping which stands either for a derivative, a subdi¤erential or a pseudodi¤erential in the sense of Jeyakumar and Luc. We establish some links between the corresponding classes of pseudoconvex, quasiconvex and another class of generalized convex functions we introduced...
متن کاملGeneralized convex functions and generalized di¤erentials
We study some classes of generalized convex functions, using a generalized di¤erential approach. By this we mean a set-valued mapping which stands either for a derivative, a subdi¤erential or a pseudodi¤erential in the sense of Jeyakumar and Luc. We establish some links between the corresponding classes of pseudoconvex, quasiconvex and another class of generalized convex functions we introduced...
متن کاملOn Generalized Monotone Multifunctions with Applications to Optimality Conditions in Generalized Convex Programming
Characterization of quasiconvexity and pseudoconvexity of lower semicontinuous functions on Banach spaces are presented in terms of abstract subdifferentials relying on a Mean Value Theorem. We give some properties of the normal cone to the lower level set of f . We also obtain necessary and sufficient optimality conditions in quasiconvex and pseudoconvex programming via variational inequalities.
متن کاملFritz-John Type Optimality Conditions for Weak Efficient Solutions of Vector Equilibrium Problems with Constraints in Terms of Contingent Epiderivatives∗
In this paper, Fritz-John type optimality conditions for weak efficient solutions in terms of contingent epiderivatives of vector variational inequalities and vector optimization problems with constraints are derived. Under assumptions on quasiconvexity of scalar functions, Fritz-John type necessary optimality conditions become Fritz-John type sufficient optimality conditions. Mathematics Subje...
متن کاملFirst order optimality conditions for generalized semi-infinite programming problems
In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 17 شماره
صفحات -
تاریخ انتشار 2006